package hard.寻找两个正序数组的中位数;

import java.util.Arrays;

/**
 * @author CodeX
 * @since 2020-10-09 15:17:37
 */
public class Main {
    public static void main(String[] args) {
        int[] m = {1, 4};
        int[] n = {2, 3, 4, 5, 6};

        double medianSort = FindMedianSortedArrays.findMedianSortedArrays(m, n);

        System.out.println("数组：" + Arrays.toString(m) + "和数组：" + Arrays.toString(n) + "的中位数为：" + medianSort);
    }
}
